Monotone Boolean formulas can approximate monotone linear threshold functions
نویسندگان
چکیده
منابع مشابه
Monotone Boolean formulas can approximate monotone linear threshold functions
We show that any monotone linear threshold function on n Boolean variables can be approximated to within any constant accuracy by a monotone Boolean formula of poly(n) size.
متن کاملMonotone Boolean Functions with s Zeros Farthest from Threshold Functions
Let Tt denote the t-threshold function on the n-cube: Tt(x) = 1 if |{i : xi = 1}| ≥ t, and 0 otherwise. Define the distance between Boolean functions g and h, d(g, h), to be the number of points on which g and h disagree. We consider the following extremal problem: Over a monotone Boolean function g on the n-cube with s zeros, what is the maximum of d(g, Tt)? We show that the following monotone...
متن کاملMonotone circuits for monotone weighted threshold functions
Weighted threshold functions with positive weights are a natural generalization of unweighted threshold functions. These functions are clearly monotone. However, the naive way of computing them is adding the weights of the satisfied variables and checking if the sum is greater than the threshold; this algorithm is inherently non-monotone since addition is a non-monotone function. In this work w...
متن کاملInfluences of monotone Boolean functions
Recently, Keller and Pilpel conjectured that the influence of a monotone Boolean function does not decrease if we apply to it an invertible linear transformation. Our aim in this short note is to prove this conjecture.
متن کاملAlgorithms counting monotone Boolean functions
We give a new algorithm counting monotone Boolean functions of n variables (or equivalently the elements of free distributive lattices of n generators). We computed the number of monotone functions of 8 variables which is 56 130 437 228 687 557 907 788. 2001 Elsevier Science B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/j.dam.2004.02.003